Nonexistence of some Griesmer codes of di - mension 4 over F q 1
نویسندگان
چکیده
We prove the nonexistence of [gq(4, d), 4, d]q codes for (a) d = q /2−q− 2q+1 for q = 2, h ≥ 3, (b) d = 2q−3q−2q+1 for q ≥ 7, and (c) d = 2q−rq−q+1 for 3 ≤ r ≤ q − q/p, q = p with p prime, where gq(k, d) = ∑k−1 i=0 ⌈ d/q ⌉
منابع مشابه
On the Minimum Length of Linear Codes over the Field of 9 Elements
We construct a lot of new [n, 4, d]9 codes whose lengths are close to the Griesmer bound and prove the nonexistence of some linear codes attaining the Griesmer bound using some geometric techniques through projective geometries to determine the exact value of n9(4, d) or to improve the known bound on n9(4, d) for given values of d, where nq(k, d) is the minimum length n for which an [n, k, d]q ...
متن کاملThe nonexistence of some quaternary linear codes of dimension 5
We prove the nonexistence of linear codes with parameters [400; 5; 299]4, [401; 5; 300]4, [405; 5; 303]4, [406; 5; 304]4, [485; 5; 363]4 and [486; 5; 364]4 attaining the Griesmer bound. For that purpose we give a characterization of linear codes with parameters [86; 4; 64]4, [101; 4; 75]4, [102; 4; 76]4 and [122; 4; 91]4. c © 2001 Elsevier Science B.V. All rights reserved.
متن کاملOn the Minimum Length of some Linear Codes of Dimension 5
One of the interesting problems in coding theory is to determine the valuenq(k, d) which denotes the smallest number n such that an [n, k,d]q code existsfor given k, d and q.For k ≤ 5, there are many results for q ≤ 5 and for k = 6, the results areconcentrated in the ternary code ([1],[3]). In this talk, we concentrated in theproblem to find the exact value nq(6, d)....
متن کاملOptimal Four-Dimensional Codes over GF(8)
We prove the nonexistence of several four-dimensional codes over GF(8) that meet the Griesmer bound. The proofs use geometric methods based on the analysis of the weight structure of subcodes. The specific parameters of the codes ruled out are: [111, 4, 96], [110, 4, 95], [102, 4, 88], [101, 4, 87], [93, 4, 80], and the sequence [29 − j, 4, 24 − j], for j = 0, 1, 2.
متن کاملSeveral Classes of Trace Codes With Either Optimal Two Weights or a Few Weights over $\mathbb{F}_{q}+u\mathbb{F}_{q}$
Abstract. Let p be a prime number, q = p for a positive integer s. For any positive divisor e of q− 1, we construct an infinite families codes of dimension 2m with few Lee-weight. These codes are defined as trace codes over the ring R = Fq + uFq, u 2 = 0. Using Gauss sums, their Lee weight distribution is provided. When gcd(e,m) = 1, we obtain an infinite family of two-weight codes which meet t...
متن کامل